On Counting AC0 Circuits with Negative Constants
نویسندگان
چکیده
Continuing the study of the relationship between TC 0 , AC 0 and arithmetic circuits, started by Agrawal et al. 1], we answer a few questions left open in this paper. Our main result is that the classes DiiAC 0 and GapAC 0 coincide, under poly-time, log-space, and log-time uniformity. From that we can derive that under logspace uniformity, the following equalities hold:
منابع مشابه
Tight Bounds on the Fourier Spectrum of AC0
We show that AC0 circuits on n variables with depth d and sizem have at most 2−Ω(k/ logd−1 m) of their Fourier mass at level k or above. Our proof builds on a previous result by Håstad (SICOMP, 2014) who proved this bound for the special case k = n. Our result improves the seminal result of Linial, Mansour and Nisan (JACM, 1993) and is tight up to the constants hidden in the Ω notation. As an a...
متن کاملCertifying polynomials for AC0[⊕] circuits, with applications
In this paper, we introduce and develop the method of certifying polynomials for proving AC0[⊕] circuit lower bounds. We use this method to show that Approximate Majority cannot be computed by AC0[⊕] circuits of size n1+o(1). This implies a separation between the power of AC0[⊕] circuits of nearlinear size and uniform AC0[⊕] (and even AC0) circuits of polynomial size. This also implies a separa...
متن کاملCounting Results in Weak Formalisms
The counting ability of weak formalisms is of interest as a measure of their expressive power. The question was investigated in several papers in complexity theory [ABO84,FKPS85,DGS86] and in weak arithmetic [PW87]. In each case, the considered formalism (AC0{circuits, rst{order logic, 0, respectively) was shown to be able to count precisely up to a polylogarithmic number. An essential part of ...
متن کاملOn Tc 0 , Ac 0 , and Arithmetic Circuits 1
Continuing a line of investigation that has studied the function classes #P [Val79b], #SAC1 [Val79a, Vin91, AJMV], #L [AJ93b, Vin91, AO94], and #NC1 [CMTV96], we study the class of functions #AC0. One way to de ne #AC0 is as the class of functions computed by constant-depth polynomial-size arithmetic circuits of unbounded fan-in addition and multiplication gates. In contrast to the preceding fu...
متن کاملSeparation of AC0[⊕] Formulas and Circuits
This paper gives the first separation between the power of formulas and circuits of equal depth in the AC0[⊕] basis (unbounded fan-in AND, OR, NOT and MOD2 gates). We show, for all d(n) ≤ O( logn log logn ), that there exist polynomial-size depth-d circuits that are not equivalent to depth-d formulas of size no(d) (moreover, this is optimal in that no(d) cannot be improved to nO(d)). This resul...
متن کامل